Cluster Consensus on Discrete-Time Multi-Agent Networks
نویسندگان
چکیده
منابع مشابه
Consensus Control of Discrete-time Multi- Agent Systems
In this paper has been studied the problem of consensusability for singleinput discrete-time MASs over directed communication graphs with fixed topology. The control input of each agent can only use its local state and the states of its neighbors. The results obtained in this paper extend some recent known results for the case when the network topology is a weighted digraph jointly containing a...
متن کاملConsensus of discrete-time multi-agent systems with adversaries and time delays
(2014). Consensus of discrete-time multi-agent systems with adversaries and time delays. This paper studies the resilient asymptotic consensus problem for discrete-time Multi-Agent Systems in the presence of adversaries and transmission delays. The network is assumed to have p loyal agents and n − p adversarial agents, and each loyal agent in the network has no knowledge of the network topology...
متن کاملState Consensus for Discrete-time Multi-agent Systems over Time-varying Graphs
We study the state consensus problem for linear shift-invariant discrete-time homogeneous multi-agent systems (MASs) over time-varying graphs. A novel approach based on the small gain theorem is proposed to design the consensus control protocols for both neutrally stable and neutrally unstable MASs, assuming the uniformly connected graphs. It is shown that the state consensus can be achieved fo...
متن کاملConsensus protocols for discrete-time multi-agent systems with time-varying delays
This paper addresses consensus problems for discrete-time multi-agent systems with time-varying delays and switching interaction topologies and provides a class of effective consensus protocols that are built on repeatedly using the same state information at two time-steps. We show that those protocols can solve consensus problems under milder conditions than the popular consensus algorithm pro...
متن کاملConsensus in discrete-time nonlinearly coupled networks
We consider consensus algorithms for multi-agent networks with discrete-time linear identical MIMO agents. The agents may be of arbitrary order, the interaction topology may be time-varying and the couplings may be nonlinear and uncertain, however assumed to satisfy a slope restriction or, more generally, quadratic constraint. Using the discrete-time version of the KYP Lemma (referred to as the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abstract and Applied Analysis
سال: 2012
ISSN: 1085-3375,1687-0409
DOI: 10.1155/2012/274735